More on pseudospectra for polynomial eigenvalue problems and applications in control theory
نویسندگان
چکیده
Definitions and characterizations of pseudospectra are given for rectangular matrix polynomials expressed in homogeneous form: P(α, β) = αAd + αd−1βAd−1 + · · · + βA0. It is shown that problems with infinite (pseudo)eigenvalues are elegantly treated in this framework. For such problems stereographic projection onto the Riemann sphere is shown to provide a convenient way to visualize pseudospectra. Lower bounds for the distance to the nearest nonregular polynomial and the nearest uncontrollable dth order system (with equality for standard state-space systems) are obtained in terms of pseudospectra, showing that pseudospectra are a fundamental tool for reasoning about matrix polynomials in areas such as control theory. How and why to incorporate linear structure into pseudospectra is also discussed by example. © 2002 Elsevier Science Inc. All rights reserved. AMS classification: 65F15; 15A22
منابع مشابه
Structured Pseudospectra for Polynomial Eigenvalue Problems, with Applications
Pseudospectra associated with the standard and generalized eigenvalue problems have been widely investigated in recent years. We extend the usual definitions in two respects, by treating the polynomial eigenvalue problem and by allowing structured perturbations of a type arising in control theory. We explore connections between structured pseudospectra, structured backward errors, and structure...
متن کاملPseudospectra of rectangular matrices
Pseudospectra of rectangular matrices vary continuously with the matrix entries, a feature that eigenvalues of these matrices do not have. Some properties of eigenvalues and pseudospectra of rectangular matrices are explored, and an efficient algorithm for the computation of pseudospectra is proposed. Applications are given in (square) eigenvalue computation (Lanczos iteration), square pseudosp...
متن کاملBackward errors and pseudospectra for structured nonlinear eigenvalue problems
Minimal structured perturbations are constructed such that an approximate eigenpair of a nonlinear eigenvalue problem in homogeneous form is an exact eigenpair of an appropriately perturbed nonlinear matrix function. Structured and unstructured backward errors are compared. These results extend previous results for (structured) matrix polynomials to more general functions. Structured and unstru...
متن کاملAn improved grid method for the computation of the pseudospectra of matrix polynomials
Pseudospectra of matrix polynomials have been systematically investigated in the last years, since they provide important insights into the sensitivity of polynomial eigenvalue problems. An accurate approximation of the pseudospectrum of a matrix polynomial P (λ) by means of the standard grid method is computationally high demanding. In this paper, we propose an improvement of the grid method, ...
متن کاملOn the Pseudospectra of Matrix Polynomials
The pseudospectra of a matrix polynomial P (λ) are sets of complex numbers that are eigenvalues of matrix polynomials which are near to P (λ), i.e., their coefficients are within some fixed magnitude of the coefficients of P (λ). Pseudospectra provide important insights into the sensitivity of eigenvalues under perturbations, and have several applications. First, qualitative properties concerni...
متن کامل